Bootstrapping the minimal 3D SCFT

Bootstrapping Grounded Symbols by Minimal Autonomous Robots

Minimal enclosing parallelepiped in 3D

We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepipeds, from which we derive two algorithms of theoretical complexity O(n6). Experiments show that in practice our quickest algorithm runs in O(n2) (at least for n 105). We also present our application in structural biolo...

Minimal enclosing parallelepiped in 3D

Bootstrapping incremental dialogue systems from minimal data: the generalisation power of dialogue grammars

We investigate an end-to-end method for automatically inducing task-based dialogue systems from small amounts of unannotated dialogue data. It combines an incremental semantic grammar Dynamic Syntax and Type Theory with Records (DS-TTR) with Reinforcement Learning (RL), where language generation and dialogue management are a joint decision problem. The systems thus produced are incremental: dia...

Determining Minimal Transitions Between VRCC-3D+ Relations

3D models are used in many problem domains. Typically the spatial relations between objects are approximated as necessary for human recognition of an image. For some applications, this may be insufficient; a more precise analysis may be required, and a temporal sequence of configurations of the objects may need to be considered. VRCC-3D+ is the implementation of a Region Connection Calculus (RC...